Easily Testable Image Operators: The Class of Circuits Where Evolution Beats Engineers
نویسندگان
چکیده
The paper deals with a class of image filters in which the evolutionary approach consistently produces excellent and innovative results. Furthermore, a method is proposed that leads to the automatic design of easily testable circuits. In particular we evolved “salt and pepper” noise filters, random shot noise filters, Gaussian noise filters, uniform random noise filters, and edge detectors.
منابع مشابه
Lukas Sekanina
Chapter 7 of the book Evolvable Components) Functional-level Cartesian genetic programming was applied to design hardware implementations of low-level, 3x3 kernel image filters (8 bits/pixel). These filters produce images of comparable or better quality than conventional, human-designed, solutions, such as convolution or median filters. Their implementation cost (the number of equivalent gates)...
متن کاملDesigning of Testable Reversible QCA Circuits Using a New Reversible MUX 2×1
Recently testing of Quantum-dot Cellular Automata (QCA) Circuits has attracted a lot of attention. In this paper, QCA is investigated for testable implementations of reversible logic. To amplify testability in Reversible QCA circuits, a test method regarding to Built In Self Test technique is developed for detecting all simulated defects. A new Reversible QCA MUX 2×1 desig...
متن کاملDesigning of Testable Reversible QCA Circuits Using a New Reversible MUX 2×1
Recently testing of Quantum-dot Cellular Automata (QCA) Circuits has attracted a lot of attention. In this paper, QCA is investigated for testable implementations of reversible logic. To amplify testability in Reversible QCA circuits, a test method regarding to Built In Self Test technique is developed for detecting all simulated defects. A new Reversible QCA MUX 2×1 desig...
متن کاملOn Synthesis of Easily Testable (k, K) Circuits
A (k;K) circuit is one which can be decomposed into nonintersecting blocks of gates where each block has no more than K external inputs, such that the graph formed by letting each block be a node and inserting edges between blocks if they share a signal line, is a partial k-tree. (k;K) circuits are special in that they have been shown to be testable in time polynomial in the number of gates in ...
متن کاملA Class of compact operators on homogeneous spaces
Let $varpi$ be a representation of the homogeneous space $G/H$, where $G$ be a locally compact group and $H$ be a compact subgroup of $G$. For an admissible wavelet $zeta$ for $varpi$ and $psi in L^p(G/H), 1leq p <infty$, we determine a class of bounded compact operators which are related to continuous wavelet transforms on homogeneous spaces and they are called localization operators.
متن کامل